Numerical Integration over Curved Domains Using Convex Quadrangulations and Gauss Legendre Quadrature Rules

This paper presents a numerical integration formula for the evaluation of where and is any curved domain in . That is a closed domain with boundary composed of N oriented piecewise curved segments with end points , and . We Join each of these curved segments to a reference point interior to the domain . This creates N triangles ) in and each of these triangles have one curved side and two straight sides. We transform each into a standard triangle T which also transforms the integrand to = . We then divide T into right isosceles triangles of side lengths 1/m units. These triangles will be finally divided into three special quadrilaterals . This process can be expressed as where represent the transformed forms of the integrand over the domains T, and . We approximate the curved segments by a parabolic arc which passes through the four points of the curved segment, the two end points , and the two intermediate points of . Proposed numerical integration formula is applied to integrate over a curved domain in the shape of lunar model for complicated integran

Towards the Development of a Framework for Socially Responsible Software by Analyzing Social Media Big Data on Cloud Through Ontological Engineering

AbstractA socially responsible internet is the need of the hour considering its huge potential and role in educating and transforming the society. Social computing is emerging as an important area as far as development of next generation web is concerned. With the proliferation of social networking applications, vast amount of data is available on cloud, which may be analyzed to gain useful insight into behavioral and linguistic patterns of different cultural and socio-economic groups further classified on the basis of gender and age etc. The idea is to come up with an appropriate framework for socially responsible software artifacts. These artifacts will monitor online social network data and analyze it from the perspective of socially responsible behavior based on ontological engineering concepts. Identification of socially responsible agents is such an example, though based on a different approach. More examples may be taken from literature dealing with microblog analytics, social semantic web, upper ontology for social web, and social-network-sourced big data analytics. In the present work, it is proposed to focus on analysis/monitoring of socially responsible behavior of social media big data and develop an upper level ontology as the framework/tool for such an analytics

A New Approach to Automatic Generation of all Quadrilateral Finite Element Mesh for Planar Multiply Connected Regions

A new approach for the automatic generation and refinement of finite element meshes over multiply connected planar regions has been developed. This paper represents continuation of authors research activities in that area. An algorithm for producing a triangular mesh in a convex polygon is presented in authors recent work. It is used for the finite element triangulation of a complex polygonal region of the plane decomposed into convex polygons. We decompose the convex polygonal regions into simple sub regions in the shape of triangles. These simple regions are then triangulated to generate a fine mesh of triangular elements. We then propose an automatic triangular to quadrilateral conversion scheme.In this scheme, each isolated triangle is split into three quadrilaterals according to the usual scheme, adding three vertices in the middle of the edges and a vertex a the barycentre of the element. To preserve the mesh conformity, a similar procedure is also applied to every triangle of the domain to fully discretize the given complex polygonal domain into all quadrilaterals, thus propagating uniform refinement. This simple method generates a mesh whose elements confirm well to the requested shape by refining the problem domain. We have modified these algorithms and demonstrated their use by generating high quality meshes for some typical multiply connected regions: square domains with regular polygonal holes inside and vice versa. We have also made improvements and modifications to to the above triangulation algorithm of the triangle which can now triangulate a trapezium cut out of a triangle. This new algorithm on the triangulation of a trapezium cut out of a triangle is applied to quadrangulate the planar regions in the shape of a circular annulus and square domain with a square hole inside. We have appended MATLAB programs which incorporate the mesh generation schemes developed in this paper. These programs provide valuable output on the nodal coordinates, element connectivity and graphic display of the all quadrilateral mesh for application to finite element analysi

A New Approach to an all Quadrilateral Mesh Generation over Arbitrary Linear Polygonal Domains for Finite Element Analysis

This paper describes a scheme for finite element mesh generation of a convex, non-convex polygon and multiply connected linear polygon. We first decompose the arbitrary linear polygon into simple sub regions in the shape of polygons.These subregions may be simple convex polygons or cracked polygons.We can divide a nonconvex polygon into convex polygons and cracked polygons We then decompose these polygons into simple sub regions in the shape of triangles. These simple regions are then triangulated to generate a fine mesh of triangular elements. We propose then an automatic triangular to quadrilateral conversion scheme. Each isolated triangle is split into three quadrilaterals according to the usual scheme, adding three vertices in the middle of the edges and a vertex at the barrycentre of the element. To preserve the mesh conformity a similar procedure is also applied to every triangle o f the domain to fully discretize the given convex polygonal domain into all quadrilaterals, thus propagating uniform refinement. This simple method generates a high quality mesh whose elements confirm well to the requested shape by refining the problem domain. The proposed scheme has been realized as computer programs and a number of examples have been included to demonstrate the technique. Although the paper describes the scheme as applied to planar domains, it could be extended to three dimensions as well

Not Available

Not AvailableNot AvailableNot Availabl

Not Available

Not AvailableRotary weeding blade is one of the important component for a tractor operated rotary weeder and need to be designed in such a way that they have enough strength in order to avoid the unbalancing force on the rotary weeder. The application of computer aided design (CAD) for structural analysis of rotary weeding blades on the basis of finite element method was carried out using ANSYS-software for three types of weeding blades viz., L, C and J-type. The different types of weeding blades are geometrically constrained with preparation of solid model and the simulation is done with actual field performance rating parameters along with boundary conditions. Prediction of stress distributions among the blades is important for the designers and manufacturers in order to minimize the errors and breakdowns. The analysis showed that, the maximum and minimum principal stresses were found to be 439.35 and 9.09 MPa respectively with a total deformation of 3.05 mm for L-type blade. Whereas for C-type blade, these values were 729.9 and 38.84 MPa respectively with a 4.65 mm total deformation. While the maximum and minimum principal stresses for J-type blade were found to be 362.68 and 17.7 MPa respectively with a total deformation of 1.65 mm. It was observed that, the stress values were within the limits of the yield stress of the material (758 MPa). Hence, the blades designed and selected for the study could be adopted for the development of the rotary weeder.Not Availabl

Not Available

Not AvailableNot AvailableNot Availabl

Not Available

Not AvailableA study was conducted to optimize the operational parameters viz., forward speed, rotary speed and type of blade for development of a tractor operated rotary weeder. The weeder was designed using computer aided design (CAD) software and prototype was fabricated and operational parameters viz., three forward speeds (2.0, 2.5 and 3.0 km h-1), two rotary speeds (210 and 240 rpm) and three types of blades (L-type, C-type and J-type) were selected to evaluate its performance for weeding in redgram crop in field conditions. The results indicated that the maximum weeding efficiency of 92.5% with a field capacity of 0.42 ha h-1 and fuel consumption of 5.2 l h-1 was recorded with minimum plant damage (3.15%). The field performance of the weeder was found to be better at 2.5 km h-1 with a rotary speed of 210 rpm for L-type blade compared to other types which were selected as optimized conditions for rotary weeder.Not Availabl

Not Available

Not AvailableNot AvailableNot Availabl

Not Available

Not AvailableNot AvailableNot Availabl